Applications of Eulerian splitting-off
نویسنده
چکیده
The aim of the present paper is to show how a slight generalization of a splitting-off result of Berstimas and Teo [1] offers a common understanding of several seemingly unrelated results in graph connectivity theory.
منابع مشابه
A note on mixed graphs and directed splitting off
We give counterexamples to two conjectures in \Bill Jackson, Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs, Journal of Graph Theory, 12(3):429{436, 1988" concerning orientations of mixed graphs and splitting oo in digraphs, and prove the rst conjecture in the (di-) Eulerian case(s). Beside that we solve the degree constrained directed augmentation pr...
متن کاملElectrodeposited Co-Pi Catalyst on α-Fe2O3 Photoanode for Water-Splitting Applications
Optoelectronic properties of hematite (α-Fe2O3) as a photoanode and the required over-potential in photo-assisted water splitting has been improved by presence of Co-Pi on its surface. In order to increase the lifetime of the photogenerated holes and lower the applied bias, cobalt-phosphate (Co-Pi) on nanostructured α-Fe2O3 by electrodeposition was de...
متن کاملA Conservative Eulerian Numerical Scheme for Elastoplasticity and Application to Plate Impact Problems
We present a numerical method for computing elasto-plastic ows in metals. The method uses a conservative Eulerian formulation of elasto-plasticity together with a higher-order Godunov nite diierence method combined with tracking of material boundaries. The Eulerian approach avoids the problem of mesh distortion caused by a Lagrangian remap, and can be easily extended to the computation of ows i...
متن کاملEnumeration of digraph embeddings
A cellular embedding of an Eulerian digraph D into a closed surface is said to be directed if the boundary of each face is a directed closed walk in D. The directed genus polynomial of an Eulerian digraph D is the polynomial ΓD(x) = ∑ h≥0 gh(D)x h where gh(D) is the number of directed embeddings into the orientable surface Sh, of genus h, for h = 0, 1, . . . . The sequence {gh(D)|h ≥ 0}, which ...
متن کاملEulerian detachments with local edge-connectivity
For a graph G, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph G by applying detachment operations at several vertices is called a detachment of graph G. We consider a detachme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007